Tree optimization based heuristics and metaheuristics in network construction problems

We consider a recently introduced class of network construction problems where edges transportation need to be constructed by server (construction crew). The has constant speed which is much lower than its travel speed, so relocation times are negligible with respect times. It required find schedule that minimizes non-decreasing function the when various connections interest become operational. Most this strongly NP-hard on general networks, but often tree-efficient, is, polynomially solvable trees. develop generic local search heuristic approach and two metaheuristics (Iterated Local Search Tabu Search) for solving tree-efficient explore them computationally. Results computational experiments indicate methods have excellent performance.